Classification of security properties in a Linda-like process algebra
نویسنده
چکیده
We provide a classification of noninterference-based security properties for the formal analysis of secure information flow in concurrent and distributed systems. This is done in the setting of a process algebra modeling some Linda coordination primitives (asynchronous communication and read operation). For this purpose, we define relaxed notions of behavioural equivalence that take into account the observational power of the external observer. The resulting taxonomy is compared with analogous security definitions based on synchronous communication models, thus emphasizing the influence of the Linda coordination model upon the expressivity of the security properties, by giving a new intuition to the relative merits.
منابع مشابه
Process algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملTense like equality algebras
In this paper, first we define the notion of involutive operator on bounded involutive equality algebras and by using it, we introduce a new class of equality algebras that we called it a tense like equality algebra. Then we investigate some properties of tense like equality algebra. For two involutive bounded equality algebras and an equality homomorphism between them, we prove that the tense ...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملClassification of monoids by Condition $(PWP_{ssc})$
Condition $(PWP)$ which was introduced in (Laan, V., {it Pullbacks and flatness properties of acts I}, Commun. Algebra, 29(2) (2001), 829-850), is related to flatness concept of acts over monoids. Golchin and Mohammadzadeh in ({it On Condition $(PWP_E)$}, Southeast Asian Bull. Math., 33 (2009), 245-256) introduced Condition $(PWP_E)$, such that Condition $(PWP)$ implies it, that is, Condition $...
متن کاملA Classiication of Security Properties for Process Algebras a Classification of Security Properties for Process Algebras 1
Several information ow security deenitions, proposed in the literature, are generalized and adapted to the model of labelled transition systems. This very general model has been widely used as a semantic domain for many process algebras , e.g. CCS. As a by-product, we provide a process algebra similar to CCS with a set of security notions, hence relating these two areas of concurrency research....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Sci. Comput. Program.
دوره 63 شماره
صفحات -
تاریخ انتشار 2006